Threat and benign interpretation bias might not be a unidimensional construct
نویسندگان
چکیده
منابع مشابه
Interpretation bias for uncertain threat: A replication and extension.
BACKGROUND Intolerance of uncertainty (IU) has been proposed as an important transdiagnostic variable within various anxiety-related disorders. Research has suggested that individuals high in IU may interpret ambiguous information in a more threatening manner, suggesting a negative interpretation bias for uncertain information. However, interpretation biases within IU have not been adequately t...
متن کاملPerhaps Unidimensional Is Not Unidimensional
Miller (1956) identified his famous limit of 7 ± 2 items based in part on absolute identification-the ability to identify stimuli that differ on a single physical dimension, such as lines of different length. An important aspect of this limit is its independence from perceptual effects and its application across all stimulus types. Recent research, however, has identified several exceptions. We...
متن کاملWhat Might Cognition Be, If Not Computation?
structure of the target phenomenon, for various reasons researchers in this approach standardly provide a concrete model: an actual computer programmed so that (hopefully) it realizes the same (or a relevantly similar) abstract computational system as is realized by the cognitive systems under study. If the concrete model appears able to perform actual cognitive tasks in much the way people do,...
متن کاملWhen Left Might Not Be Right
Copyright © 2010-2011, Usability Professionals’ Association and the authors. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to pos...
متن کاملInverting onto functions might not be hard
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence that such functions are hard, for example, if TFNP is computable in polynomial-time does this imply the polynomial-time hierarchy collapses? We give a relativized negative answer to this question by exhibiting an oracle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognition and Emotion
سال: 2019
ISSN: 0269-9931,1464-0600
DOI: 10.1080/02699931.2019.1682973